Netsight requires Java JRE 1.4 or
greater in order to run. Make sure that the java.exe
file of JRE 1.4 or greater is included in your system path.
If you are loading large graphs in Netsight, you need to allocate sufficient memory to the Java VM. You do this by appending the flags –Xms512m and –Xmx512m to the ‘java’ command. This allocates 512 Mb of memory to the Java VM. Netsight has been tested with no problems with this amount of memory.
For more information, refer to this web site:
http://java.sun.com/j2se/1.4.2/docs/tooldocs/windows/java.html#Xms
a. Click
File à
Open.
b. Select
a Pajek or GraphML file.
c. Click
Open.
a. Invalid
file extension – Error message displayed.
b. File
not found – Error message displayed.
a. Click
File à
Save.
b. Type
a file name into the File Name text field.
c. Click
Save.
a. Click
File à
Open filename.
a. Click
File à
Exit.
OR
b. Click
the Close icon in the Netsight window.
a. Open a graph.
b. Click
Graph à
Show Graph.
a. Display a graph.
b. Click
Graph à
Redraw.
a. Click
the “Visualize When Traversing Graph History” check box.
a. Click Filters à Apply Filters. The Filters List dialog window will be displayed.
b. Click Add. The Create Filter dialog window will be displayed.
c. To add a filter to the filters list:
i. Select KNeighborhood Filter from the list.
ii. Select at least one vertex from the Vertex Browser on the right.
iii. Select the k-distance away from the selected node(s) that you want your subgraph to contain using the distance spinner widget.
i. Select Degree Filter from the list.
ii. Select the lower bound number of incident edges that a vertex in your subgraph can have using the Min spinner widget.
iii. Select the upper bound number of incident edges that a vertex in your subgraph can have using Max spinner widget.
Note: The lower bound cannot be greater than the upper bound.
i. Select Vertex Set Filter from the list.
ii. Select at least one vertex which you do not want to be included in your subgraph from the Vertex Browser on the right.
d. Click Add.
e. Repeat (a) – (d) for any number of filters.
f.
Click Create Graph to draw the final filtered graph.
a. If
the graph you are creating has more then 250 vertices, graph drawing will be
slow. You will be prompted to confirm the drawing of the graph.
a. Do
Step (a) in Create a subgraph and then click Calculate size
a. Ensure
that the graph is displayed
b. Click
Algorithms à
PageRank
a. Ensure
that the graph is displayed
b. Ensure
that at least one vertex is selected
c. Click
Algorithms à
PageRank w/Priors
a. No
vertex selected – Error message displayed
a. Ensure
the graph is displayed
b. Ensure
that only two vertices are selected
c. Click
Algorithms à
S-T Betweenness
a. Not
exactly two vertices are selected – Error message displayed
a. Click
Window à
Show Debug Dialog
a. Click Window à Show Vertex Dialog
a. Click the back arrow button in the toolbar
a. Click the forward arrow button in the toolbar
a. Click the Freeze button in the toolbar
a. Double-click
using the left mouse button on a vertex label in the top vertex list
OR
Double-click using the left mouse button on a vertex in the main window
a. Double-click
using the left mouse button on a selected vertex in the top vertex list
OR
Double-click using the left mouse button on a selected vertex in the selected vertices list (the bottom list)
OR
Double-click using the left mouse button on a selected vertex in the main window
a. Enter
the part of or the entire vertex label you want to search for in the Find
Vertex text field
b. Click
on Find or hit Enter
a. Vertex
not found – Not found message displayed
a. Click
on the “Clear all selected vertices” button in the vertex viewer